Algebraic unimodular counting
نویسندگان
چکیده
منابع مشابه
Algebraic unimodular counting
We study algebraic algorithms for expressing the number of non-negative integer solutions to a unimodular system of linear equations as a function of the right hand side. Our methods include Todd classes of toric varieties via Gröbner bases, and rational generating functions as in Barvinok’s algorithm. We report polyhedral and computational results for two special cases: counting contingency ta...
متن کاملFast Unimodular Counting
This paper describes methods for counting the number of non-negative integer solutions of the system Ax = b when A is a non-negative totally unimodular matrix and b an integral vector of fixed dimension. The complexity (under a unit cost arithmetic model) is strong in the sense that it depends only on the dimensions of A and not on the size of the entries of b. For the special case of “continge...
متن کاملAlgebraic model counting
Weighted model counting (WMC) is a well-known inference task on knowledge bases, and the basis for some of the most efficient techniques for probabilistic inference in graphical models. We introduce algebraic model counting (AMC), a generalization of WMC to a semiring structure that provides a unified view on a range of tasks and existing results. We show that AMC generalizes many well-known ta...
متن کاملCounting Algebraic Numbers with Large Height Ii
We count algebraic numbers of fixed degree over a fixed algebraic number field. When the heights of the algebraic numbers are bounded above by a large parameter H, we obtain asymptotic estimates for their cardinality as H → ∞.
متن کاملCounting Rational Points on Algebraic Varieties
In these lectures we will be interested in solutions to Diophantine equations F (x1, . . . , xn) = 0, where F is an absolutely irreducible polynomial with integer coefficients, and the solutions are to satisfy (x1, . . . , xn) ∈ Z. Such an equation represents a hypersurface in A, and we may prefer to talk of integer points on this hypersurface, rather than solutions to the corresponding Diophan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2003
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-003-0383-9